THE EULER FUNCTION GRAPH $G(\phi(n))$

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Euler ’ s Phi Function and Graph Labeling

A graph G(V,E) with vertex set V is said to have a prime labeling if there exist a bijection f : V (G) → {1, 2, . . . , |V |} such that for each edge xy ∈ E(G), f(x) and f(y) are relatively prime. It becomes an interesting problem to investigate the maximum possible edges that can be constructed in a graph with n vertices having prime labeling property. We interpret this problem in number theor...

متن کامل

Euler index in uncertain graph

As the complexity of a system increases, in practical application of graph theory, different types of uncertainty are frequently encountered. In an uncertain graph, whether two vertices of the graph are joined cannot be completely determined. Within the framework of uncertainty theory, the concept of Euler index of uncertain graph is proposed. It also gives a method to calculate Euler index of ...

متن کامل

Ergodicity of the Adic Transformation on the Euler Graph

The Euler graph has vertices labelled (n, k) for n = 0, 1, 2, ... and k = 0, 1, ..., n, with k+1 edges from (n, k) to (n+1, k) and n−k+1 edges from (n, k) to (n+1, k+1). The number of paths from (0,0) to (n, k) is the Eulerian number A(n, k), the number of permutations of 1,2,...,n+1 with exactly n−k falls and k rises. We prove that the adic (Bratteli-Vershik) transformation on the space of inf...

متن کامل

Ergodicity of the adic transformation on the Euler graph 3

The Euler graph has vertices labelled (n, k) for n = 0, 1, 2, ... and k = 0, 1, ..., n, with k + 1 edges from (n, k) to (n + 1, k) and n − k + 1 edges from (n, k) to (n + 1, k + 1). The number of paths from (0,0) to (n, k) is the Eulerian number A(n, k), the number of permutations of 1,2,...,n+ 1 with exactly n− k falls and k rises. We prove that the adic (Bratteli-Vershik) transformation on th...

متن کامل

On the Euler Function of Fibonacci Numbers

In this paper, we show that for any positive integer k, the set {( φ(Fn+1) φ(Fn) , φ(Fn+2) φ(Fn) , . . . , φ(Fn+k) φ(Fn) )

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Pure and Apllied Mathematics

سال: 2017

ISSN: 1311-8080,1314-3395

DOI: 10.12732/ijpam.v116i1.4